全文获取类型
收费全文 | 1311篇 |
免费 | 140篇 |
国内免费 | 106篇 |
专业分类
化学 | 36篇 |
力学 | 15篇 |
综合类 | 19篇 |
数学 | 1356篇 |
物理学 | 131篇 |
出版年
2024年 | 7篇 |
2023年 | 23篇 |
2022年 | 33篇 |
2021年 | 21篇 |
2020年 | 63篇 |
2019年 | 51篇 |
2018年 | 50篇 |
2017年 | 50篇 |
2016年 | 37篇 |
2015年 | 27篇 |
2014年 | 63篇 |
2013年 | 99篇 |
2012年 | 68篇 |
2011年 | 109篇 |
2010年 | 100篇 |
2009年 | 125篇 |
2008年 | 100篇 |
2007年 | 64篇 |
2006年 | 93篇 |
2005年 | 60篇 |
2004年 | 50篇 |
2003年 | 40篇 |
2002年 | 44篇 |
2001年 | 24篇 |
2000年 | 30篇 |
1999年 | 26篇 |
1998年 | 26篇 |
1997年 | 22篇 |
1996年 | 6篇 |
1995年 | 11篇 |
1994年 | 7篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1976年 | 4篇 |
排序方式: 共有1557条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
5.
The paper discusses the relationship between weights and control vertices of two rational NURBS curves of degree two or three with all weights larger than zero when they represent the same curve parametrically and geometrically, and gives sufficient and necessary conditions for coincidence of two rational NURBS curves in non-degeneracy case. 相似文献
6.
The application of some recently proposed algebraic multilevel methods for the solution of two-dimensional finite element problems on nonuniform meshes is studied. The locally refined meshes are created by the newest vertex mesh refinement method. After the introduction of this refinement technique it is shown that, by combining levels of refinement, a preconditioner of optimal order can be constructed for the case of local refinement along a line. Its relative condition number is accurately estimated. Numerical tests demonstrating the performance of the proposed preconditioners will be reported in a forthcoming paper. 相似文献
7.
图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}.χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数.对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图.本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度. 相似文献
8.
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()α≤≤ ()
n
−ω. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour
number μ(G) of G: n− (n−ω)()
n
−ω≤μ(G)≤n−α() α.
Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002 相似文献
9.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for
actually finding such a partition by our proof. 相似文献
10.
A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here. 相似文献